The difficulty of solving constrained multi-objective optimization problems lies in balancing objective optimization and constraint satisfaction， while balancing the convergence and diversity of solution sets. To solve complex constrained multi-objective optimization problems with large infeasible regions and small feasible regions， a constrained multi-objective evolutionary algorithm based on Two-Stage search and Dynamic Resource Allocation （TSDRA） was proposed. In the first stage， infeasible regions were crossed by ignoring constraints； in the second stage， two kinds of computing resources were allocated dynamically to coordinate local exploitation and global exploration， while balancing the convergence and diversity of the algorithm. The simulation results on LIRCMOP and MW series test problems show that compared with four representative algorithms of Constrained Multi-objective Evolutionary Algorithm with Multiple Stages （CMOEA-MS）， Two-phase （ToP）， Push and Pull Search （PPS） and Multi Stage Constrained Multi-Objective evolutionary algorithm （MSCMO）， the proposed algorithm obtains better results in both Inverted Generational Distance （IGD） and HyperVolume （HV）. TSDRA obtains 10 best IGD values and 9 best HV values on LIRCMOP series test problems， and 9 best IGD values and 10 best HV values on MW series test problems， indicating that the proposed algorithm can effectively solve problems with large infeasible regions and small feasible regions.

The pay-per-use licensing of the Intellectual Property （IP） core enables the system designer to purchase IP at low price according to the actual situation， and has become a major method of IP licensing. To meet the pay-per-use demand of IP core， based on Reconfigurable Finite State Machine （RFSM） and Physical Unclonable Function （PUF）， a new IP licensing scheme RFSM-PUF was proposed for Field Programmable Gate Array （FPGA） IP. Aiming at the problem that the protocols of the IP protection schemes of different manufacturers cannot be used universally， an IP protection authentication protocol for the proposed scheme was proposed to ensure the confidentiality and flexibility of IP authentication. Firstly， RFSM was embedded in the Original Finite State Machine （OFSM） in the IP， and in this way， the IP was only unlocked by the IP core designer. Then， the challenges were input into the PUF circuit to produce responses. Finally， the cipher consisting of the license and PUF responses was input into the RFSM to unlock the IP. The security analysis results show that the proposed scheme meets various security indicators. RFSM-PUF scheme was tested on the LGSyth91 benchmark circuits. Experimental results show that on the premise of meeting various safety indicators， the proposed scheme reduces 1 377 Look-Up Tables （LUT） averagely at every IP core compared to the PUF based pay-per-use licensing scheme， so that the hardware overhead is significantly reduced.

An improved Principal Component Analysis (PCA) method was proposed with the synchronous multi-dimensional data stream anomaly analysis techniques. In this method, the problem of the original data stream variation tendency was mapped to the eigenvector space, and the steady-state eigenvector was solved, then the abnormal changes of the synchronous multi-dimensional data stream could be diagnosed by the relationship between the instantaneous eigenvector and the steady-state eigenvector. This method was applied to the abnormality diagnosis of the tunnel strain monitoring data stream, and the real-time monitoring and warning system for the tunnel strain was realized by using VC++. The experimental results show that the proposed method can reflect the changes of the aperiodic variables timely and realize the anomaly monitoring and early warning for multi-dimensional data stream effectively.

Since the illumination model used in existing methods of blind image forensics could not effectively represent surface lighting effects, Lambert-Phong illumination model was proposed which contained the diffusing and specular reflection of light. Leveraging this illumination model on the tampering detection of infinite light source image, the experimental results show that the illumination direction of different objects in images could be calculated accurately using the proposed illumination model, and the image tampering could be effectively identified.

In order to solve the semantic heterogeneity and achieve interoperability between Web applications of different ontology and integrating data, an improved matching algorithm of similarity propagation based on RDF graph was proposed. First, it sought to find initial similar seeds by WordNet. Then it expressed ontology as RDF triples through preprocessing. According to the characteristics of RDF graph, it expanded similarity propagation to triples to find probable similar pairs and then calculated similarities by elements' features. The procedure of similarity propagation, finding probable similar pairs and calculating similarities is a cyclic iterative process until it is convergent. The experimental results show that the algorithm is effective and has better time performance.